Incremental computation with names
نویسندگان
چکیده
منابع مشابه
Staged computation with names and necessity
Staging is a programming technique for dividing the computation in order to exploit the early availability of some arguments. In the early stages the program uses the available arguments to generate, at run time, the code for the late stages. The late stages may then be explicitly evaluated when appropriate. A type system for staging should ensure that only well-typed expressions are generated,...
متن کاملEecient Computation via Incremental Computation
Incremental computation takes advantage of repeated computations on inputs that diier slightly from one another, computing each output eeciently by exploiting the previous output. This paper gives an overview of a general and systematic approach to incrementalization. Given a program f and an operation , the approach yields an incremental program that computes f (x y) eeciently by using the res...
متن کاملFully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS ) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A,...
متن کاملE cient Computation via Incremental Computation
Incremental computation takes advantage of repeated computations on inputs that di er slightly from one another, computing each output e ciently by exploiting the previous output. This paper gives an overview of a general and systematic approach to incrementalization. Given a program f and an operation , the approach yields an incremental program that computes f(x y) e ciently by using the resu...
متن کاملIncremental Computation of Concept Diagrams
Suppose a formal context K = (G,M, I) is given, whose concept lattice B(K) with an attribute-additive concept diagram is already known, and an attribute column C = (G, {n} , J) shall be inserted to or removed from it. This document introduces and proves an incremental update algorithm for both tasks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2858965.2814305